Engineering processive DNA polymerases with maximum benefit at minimum cost
نویسندگان
چکیده
منابع مشابه
Engineering processive DNA polymerases with maximum benefit at minimum cost
DNA polymerases need to be engineered to achieve optimal performance for biotechnological applications, which often require high fidelity replication when using modified nucleotides and when replicating difficult DNA sequences. These tasks are achieved for the bacteriophage T4 DNA polymerase by replacing leucine with methionine in the highly conserved Motif A sequence (L412M). The costs are min...
متن کاملMaximum Performance at Minimum Cost in Network Synchronization
We consider two optimization problems on synchronization of oscillator networks: maximization of synchronizability and minimization of synchronization cost. We first develop an extension of the well-known master stability framework to the case of non-diagonalizable Laplacian matrices. We then show that the solution sets of the two optimization problems coincide and are simultaneously characteri...
متن کاملApproximating the Minimum - Cost Maximum Flow isP
We show that it is impossible, in NC, to approximate the value of the minimum-cost maximum ow unless P = NC.
متن کاملPopularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people, B is a set of items, and each person a ∈ A ranks a subset of items in an order of preference, with ties allowed. The popular matching problem seeks to compute a matching M∗ between people and items such that there is n...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Microbiology
سال: 2014
ISSN: 1664-302X
DOI: 10.3389/fmicb.2014.00380